Input Distance and Lower Bounds for Propositional Resolution Proof Length

نویسنده

  • Allen Van Gelder
چکیده

Input Distance ( ) is introduced as a metric for propositional resolution derivations. If F = Ci is a formula and D is a clause, then (D;F) is de ned as minijD Cij. The for a derivation is the maximum of any clause in the derivation. Input Distance provides a re nement of the clause-width metric analyzed by Ben-Sasson and Wigderson (JACM 2001) in that it applies to families whose clause width grows, such as pigeon-hole formulas. They showed two upper bounds on (W width(F)), where W is the maximum clause width of a narrowest refutation of F . It is shown here that (1) both bounds apply with (W width(F)) replaced by ; (2) for pigeon-hole formulas PHP(m;n), the minimum for any refutation is (n). A similar result is conjectured for the GT (n) family analyzed by Bonet and Galesi (FOCS 1999).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

P != NP, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle

Recent results established exponential lower bounds for the length of any Resolution proof for the weak pigeonhole principle. More formally, it was proved that any Resolution proof for the weak pigeonhole principle, with n holes and any number of pigeons, is of length fl(2 ), (for a constant e = 1/3). One corollary is that certain propositional formulations of the statement P / NP do not have s...

متن کامل

$P \ne NP$, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle

Recent results established exponential lower bounds for the length of any Resolution proof for the weak pigeonhole principle. More formally, it was proved that any Resolution proof for the weak pigeonhole principle, with n holes and any number of pigeons, is of length Ω(2n ǫ ), (for a constant ǫ = 1/3). One corollary is that certain propositional formulations of the statement P 6= NP do not hav...

متن کامل

Survey on Proof Complexity

In this survey, I will discuss two results in proof complexity. Proof complexity studies the efficiency of particular formal proof systems for proving particular formulas. The work in this area has focused on propositional logic, since results about it have a direct connection to central questions in complexity theory. In particular, we know that NP = co − NP if there is a proof system that has...

متن کامل

Lower Bounds for the Weak

We prove that any Resolution proof for the weak pigeon hole principle, with n holes and any number of pigeons, is of length (2 n), (for some global constant > 0). One corollary is that a certain propositional formulation of the statement N P 6 6 P =poly does not have short Resolution proofs.

متن کامل

Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs

As a natural extension of the SAT problem, different proof systems for quantified Boolean formulas (QBF) have been proposed. Many of these extend a propositional system to handle universal quantifiers. By formalising the construction of the QBF proof system P+∀red from a propositional proof system P (Beyersdorff, Bonacina & Chew, ITCS ‘16), we present a new technique for proving proof size lowe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005